Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
نویسندگان
چکیده
منابع مشابه
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min...
متن کاملFaster and simpler approximation algorithms for mixed packing and covering problems
We propose an algorithm for approximately solving the mixed packing and covering problem; given a convex compact set ∅ = B ⊆ RN , either compute x ∈ B such that f (x) ≤ (1 + )a and g(x) ≥ (1 − )b or decide that {x ∈ B | f (x) ≤ a, g(x) ≥ b} = ∅. Here f, g : B → RM + are vectors whose components are M non-negative convex and concave functions, respectively, and a, b ∈ RM ++ are constant positive...
متن کاملAlgorithms for multiplayer multicommodity flow problems
We investigate theMultiplayer Multicommodity Flow Problem (MMFP): several players have di erent networks and commodities over a common node set. Pairs of players have contracts where one of them agrees to route the ow of the other player (up to a given capacity) between two speci ed nodes. In return, the second player pays an amount proportional to the ow value. We show that the social optimum ...
متن کاملFaster Algebraic Algorithms for Path and Packing Problems
We study the problem of deciding whether an n-variate polynomial, presented as an arithmetic circuit G, contains a degree k square-free term with an odd coefficient. We show that if G can be evaluated over the integers modulo 2 in time t and space s, the problem can be decided with constant probability in O((kn+ t)2) time and O(kn+s) space. Based on this, we present new and faster algorithms fo...
متن کاملFaster approximation algorithms for packing and covering problems∗
We adapt a method proposed by Nesterov [19] to design an algorithm that computes optimal solutions to fractional packing problems by solving O∗( −1 √ Kn) separable convex quadratic programs, where K is the maximum number of non-zeros per row and n is the number of variables. We also show that the quadratic program can be approximated to any degree of accuracy by an appropriately defined piecewi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2007
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539704446232